Linear Algebra with Disordered Sparse Matrices that have Spatial Structure: Theory and Computation

نویسنده

  • Giorgio Parisi
چکیده

Dedication I dedicate this thesis to my father, Vincent Edward Sacksteder III, who shared with me his love for physics and for so many other things, and for me. One of my favorite science-related memories of him is of long hours during car trips when he would answer my many questions about science, industry, and lots of other subjects. Another is of him reading science fiction aloud to us. I would also like to remember my grandpa Richard Anthony Miller, who died on the day that this thesis was completed. He remains a strength to us all, and I'm very thankful for him and for the way he lived and died. And I should remember Dr. Phil Peters, who died a year after teaching me graduate level electromagnetism. 5 6 Acknowledgements I want most to thank God: the Father, his son Jesus our Saviour, and the Holy Spirit of love. I am thankful to them for the last five years which have probably been the happiest years yet in my life, for the past three and a half years living in the beautiful and holy city of Rome and traveling to many other extraordinary places, for good friends and community, for the privilege of both begining and ending this Ph.D, and for letting this Ph.D. be of a quality that I can be very proud of. But those are just the externals: the deeper reality is love. I am thankful for God's constant intimate friendship, love, and mercy, which are faithful even when I am not faithful, that have been enabling me to change slowly for the better, and that challenge me to share what I can with others. I believe that each person was created through God's deliberate choice to create that individual person and not another person, and that his choice was motivated by love, by seeing something immensely precious in the person he was choosing, and by wanting to share a friendship and a love with that person. I am very thankful for the choice that God made about me; for the gift of being alive. I also want to thank my advisor, Giorgio Parisi. Without his faithful support I probably would not have been permitted to pursue the research projects which developed into this thesis. He worked to understand what I was doing even when it didn't relate directly to his research, encouraged me, and gave …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Interactive certificate for the verification of Wiedemann's Krylov sequence: application to the certification of the determinant, the minimal and the characteristic polynomials of sparse matrices

Certificates to a linear algebra computation are additional data structures for each output, which can be used by a—possibly randomized— verification algorithm that proves the correctness of each output. Wiedemann’s algorithm projects the Krylov sequence obtained by repeatedly multiplying a vector by a matrix to obtain a linearly recurrent sequence. The minimal polynomial of this sequence divid...

متن کامل

Control by quantum dynamics on graphs

We address the study of controllability of a closed quantum system whose dynamical Lie algebra is generated by adjacency matrices of graphs. We characterize a large family of graphs that renders a system controllable. The key property is a novel graph-theoretic feature consisting of a particularly disordered cycle structure. Disregarding efficiency of control functions, but choosing subfamilies...

متن کامل

Symbolic computation of the Duggal transform

Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...

متن کامل

Symbolic and Numeric Methods for Exploiting Structure in Constructing Resultant Matrices

Resultants characterize the existence of roots of systems of multivariate nonlinear poly nomial equations while their matrices reduce the computation of all common zeros to a problem in linear algebra Sparse elimination theory has introduced the sparse resul tant which takes into account the sparse structure of the polynomials The construction of sparse resultant or Newton matrices is the criti...

متن کامل

A brief introduction to quaternion matrices and linear algebra and on bounded groups of quaternion matrices

The division algebra of real quaternions, as the only noncommutative normed division real algebra up to isomorphism of normed algebras, is of great importance. In this note, first we present a brief introduction to quaternion matrices and quaternion linear algebra. This, among other things, will help us present the counterpart of a theorem of Herman Auerbach in the setting of quaternions. More ...

متن کامل

Computing the Rank of Large Sparse Matrices over Finite Fields

We want to achieve efficient exact computations, such as the rank, of sparse matrices over finite fields. We therefore compare the practical behaviors, on a wide range of sparse matrices of the deterministic Gaussian elimination technique, using reordering heuristics, with the probabilistic, blackbox, Wiedemann algorithm. Indeed, we prove here that the latter is the fastest iterative variant of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004